Cooperation in one machine scheduling
نویسندگان
چکیده
منابع مشابه
Sgp Heuristics for One Machine Scheduling Problem
Each of N jobs is to be processed on a single machine. Only one job can be processed at any given time. Each switch from one job to another requires sequence dependent setup time. The objective is to find a processing order which minimizes the makespan. Let call this problem the OMSC problem. OMSC problem is defined as a grouping problem. A heuristics called SGP Heuristics and based on spectral...
متن کاملSchedulingLecture 1: Scheduling on One Machine
• Our context: in a computing system, we have a number of machines at hand. These machines may be close to each other, or linked with a limited communication network. We want to use this platform to execute an application, composed of several tasks. Tasks may have precedence constraints, or other type of constraints. Several users may share the platform, which might be widely distributed, or hi...
متن کاملThe one-machine just-in-time scheduling problem with preemption
This paper investigates thenotion of preemption in scheduling,with earliness and tardiness penalties. Starting from the observation that the classical cost model where penalties only depend on completion times does not capture the just-in-time philosophy, we introduce a new model where the earliness costs depend on the start times of the jobs. To solve this problem, we propose an efficient repr...
متن کاملMachine scheduling for multitask machining
Multitasking is an important part of today’s manufacturing plants. Multitask machine tools are capable of processing multiple operations at the same time by applying a different set of part and tool holding devices. Mill-turns are multitask machines with the ability to perform a variety of operations with considerable accuracy and agility. One critical factor in simultaneous machining is to cre...
متن کاملCooperation in Multi-organization Scheduling
The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We consider systems composed of n identical clusters of m processors. We show that it is always possible to produce a collaborative solution that respects participant’s selfish goals, at the same time improving the global ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ZOR - Methods and Models of Operations Research
سال: 1993
ISSN: 0340-9422,1432-5217
DOI: 10.1007/bf01414208